Measuring Segregation via Analysis on Graphs

نویسندگان

چکیده

In this paper, we use analysis on graphs to study quantitative measures of segregation. We focus a classical statistic from the geography and urban sociology literature known as Moran’s , which in our language is score associated real-valued function graph, computed with respect spatial weight matrix such adjacency geographic units that tile city. Our results characterizing extremal behavior illustrate important role underlying graph structure, especially degree distribution, interpreting score. addition standard matrices encoding unit adjacency, consider Laplacian doubly-stochastic approximation . These alternatives allow us connect ideas Fourier random walks. offer illustrations theoretical mix stylized synthetic examples real geographic/demographic data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measuring Segregation∗

We propose a set of basic properties that any reasonable segregation index should have. We then fully characterize the class of segregation indices that satisfy these basic properties. We show that every such index has a particular simple form. Finally, we show that with one rarely used exception, each index defined in the literature violates one or more of our basic properties. Journal of Econ...

متن کامل

Measuring school segregation

Using only ordinal axioms, we characterize several multigroup school segregation indices: the Atkinson Indices for the class of school districts with a given …xed number of ethnic groups and the Mutual Information Index for the class of all districts. Properties of other school segregation indices are also discussed. In an empirical application, we document a weakening of the e¤ect of ethnicity...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...

متن کامل

Measuring Two-Event Structural Correlations on Graphs

Real-life graphs usually have various kinds of events happening on them, e.g., product purchases in online social networks and intrusion alerts in computer networks. The occurrences of events on the same graph could be correlated, exhibiting either attraction or repulsion. Such structural correlations can reveal important relationships between different events. Unfortunately, correlation relati...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2023

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/21m1466773